A single server retrial queue with event-dependent arrival rates

نویسندگان

چکیده

Abstract In this work, we consider a novel single-server retrial queue with event-dependent arrival rates. Contrary to other related works, the primary customers’ rates depend on last realized event, which refers either departure, or an of type, when customer arrives during busy period, compared others. Our motivation stems from modeling service systems, in customers express their willingness join system based event. We investigate stability conditions, and derive stationary distribution both at completion epochs, arbitrary epoch. also study asymptotic behaviour under high rate retrials. Performance measures are explicitly derived, extensive numerical examples performed impact event-dependency. Moreover, constrained optimisation problems formulated solved ultimate goal optimal joining probabilities.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Single Server Bulk Queue with Service Interruption, Two Phase Repairs and State Dependent Rates

This paper reports a study on a single server queue with bulk arrival and bulk service patterns wherein the incoming traffic depends on the state of the server which may be in operating or breakdown state. The repair of the breakdown server is performed in two phases. The operating duration of server, repair duration of both phases of repairing as well as job's inter-arrival times and service t...

متن کامل

Stochastic bounds for a single server queue with general retrial times

We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds‎. ‎The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques‎.

متن کامل

On the Single-server Retrial Queue

In this work, we review the stochastic decomposition for the number of customers in M/G/1 retrial queues with reliable server and server subjected to breakdowns which has been the subject of investigation in the literature. Using the decomposition property of M/G/1 retrial queues with breakdowns that holds under exponential assumption for retrial times as an approximation in the non-exponential...

متن کامل

A Single Server Retrial Queue in Bernoulli Schedule With Feedback on Non-Retrial Customers

In this paper, we consider an M/G/1 retrial queue with Bernoulli feedback and general retrial times where the external arrivals blocked either with probability q join the infinite waiting room called non-retrial queue or with probability p, (p+q = 1) leave the service area and enter the retrial group called orbit in FIFO discipline. Also we assume that only the customer at the head of the orbit...

متن کامل

stochastic bounds for a single server queue with general retrial times

we propose to use a mathematical method based on stochastic comparisons of markov chains in order to derive performance indice bounds‎. ‎the main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (fcfs) orbit and general retrial times using the stochastic ordering techniques‎.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Operations Research

سال: 2023

ISSN: ['1572-9338', '0254-5330']

DOI: https://doi.org/10.1007/s10479-023-05263-z